Space-Partitioning RANSAC

نویسندگان

چکیده

A new algorithm is proposed to accelerate the RANSAC model quality calculations. The method based on partitioning joint correspondence space, e.g., 2D-2D point correspondences, into a pair of regular grids. grid cells are mapped by minimal sample models, estimated within RANSAC, reject correspondences that inconsistent with parameters early. technique general. It works arbitrary transformations even if set, as fundamental matrix maps epipolar lines. tested thousands image pairs from publicly available datasets and essential matrix, homography radially distorted estimation. On average, space reduces run-time 41% provably no deterioration in accuracy. When combined SPRT, drops its 30%. can be straightforwardly plugged any state-of-the-art framework. code at https://github.com/danini/graph-cut-ransac .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RANSAC versus CS-RANSAC

A homography matrix is used in computer vision field to solve the correspondence problem between a pair of stereo images. RANSAC algorithm is often used to calculate the homography matrix by randomly selecting a set of features iteratively. CSRANSAC algorithm in this paper converts RANSAC algorithm into two-layers. The first layer is addressing sampling problem which we can describe our knowled...

متن کامل

De-RANSAC: Decentralized RANSAC for Sensor Networks

This paper studies the problem of distributed consensus in the presence of spurious sensor information. We propose a new method, De-RANSAC, which allows a multi-agent system to detect outliers—erroneous measurements or incorrect hypotheses—when the sensed information is gathered in a distributed way. The method is an extension of the RANSAC (RANdom SAmple Consensus) algorithm, which leads to a ...

متن کامل

Latent RANSAC

We present a method that can evaluate a RANSAC hypothesis in constant time, i.e. independent of the size of the data. A key observation here is that correct hypotheses are tightly clustered together in the latent parameter domain. In a manner similar to the generalized Hough transform we seek to find this cluster, only that we need as few as two votes for a successful detection. Rapidly locatin...

متن کامل

Uncertain RanSaC

This paper describes a new enhancement to the technique of estimation by Random Sampling and Consensus. The current state-of-the-art random sampling schemes are discussed, in particular looking at the speed of discovery of the solution. An improved support function is examined, using linear approximations to the second moments of the parameter PDFs to more accurately propagate noise. This impro...

متن کامل

Binary Space Partitioning (BSP) Trees

A binary space partitioning (bsp) tree represents a recursive, hierarchical subdivision of d-dimensional space into convex subspaces. BSP trees provide a computational representation of space that provides both a search structure and a representation of geometry. Constructing a bsp tree consists of partitioning a subspace by means of a hyperplane, which intersects the interior of that subspace,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-19824-3_42